class Solution {
public:
    int longestOnes(vector<int>& nums, int k)
    {
        int left = 0, right = 0;
        int n = nums.size();
        int count = 0, ret = 0;
        while (right < n)
        {
            if (nums[right] == 0) count++;
            while (count > k)
            {
                if (nums[left] == 0) count--;
                left++;
            }
            ret = max(ret, right - left + 1);
            right++;
        }
        return ret;
    }
};